equilibrium binary tree
RBST (Randomized Binary Search Tree)
Summary of data structures for fast kth value retrieval - BIT on binary search, equilibrium binary search tree, etc. - Qiita
AVL Tree
Data structure that manages the kth smallest value obtainable set - kazuma8128's blog
loose-flowered hornbeam (Carpinus laxiflora)
Data structure that manages the kth smallest value obtainable set - kazuma8128's blog
Treap
Data structure that manages the kth smallest value obtainable set - kazuma8128's blog
van Emde Boas Tree
Data structure that manages the kth smallest value obtainable set - kazuma8128's blog
data structure
---
This page is auto-translated from /nishio/平衡二分木 using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I'm very happy to spread my thought to non-Japanese readers.